Designing NULL Convention Combinational Circuits to Fully Utilize Gate-Level Pipelining for Maximum Throughput

نویسنده

  • Scott C. Smith
چکیده

Since the NULL Convention Logic (NCL) paradigm is delay-insensitive, NCL combinational circuits cannot be partitioned indiscriminately when pipelining, as can clocked circuits. Instead, these circuits must be partitioned into stages, such that each stage is inputcomplete with respect to all of its inputs and delayinsensitivity is maintained. Therefore the selected architecture for an NCL circuit may vary depending on whether or not the given circuit is to be pipelined. For example, the combinational circuit that has the shortest critical path may not necessarily result in optimal throughput when pipelined. This paper presents a method called Threshold Combinational Reduction for Pipelining (TCRP), to design NCL combinational circuits that will maximize throughput when pipelined. This method is demonstrated on the design of a 4-bit × 4-bit quad-rail multiplier and a dual-rail Booth2 multiplier, showing that both designs have an additional increased throughput after pipelining, when their combinational circuitry is designed using TCRP rather than the previous Threshold Combinational Reduction (TCR) method [1].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NULL convention multiply and accumulate unit with conditional rounding, scaling, and saturation

Approaches for maximizing throughput of self-timed multiply-accumulate units (MACs) are developed and assessed using the NULL Convention Logic (NCL) paradigm. In this class of self-timed circuits, the functional correctness is independent of any delays in circuit elements, through circuit construction, and independent of any wire delays, through the isochronic fork assumption [1, 2], where wire...

متن کامل

Gate and Throughput Optimizations for Null Convention Self-timed Digital Circuits

NULL Convention Logic (NCL) provides an asynchronous design methodology employing dual-rail signals, quad-rail signals, or other Mutually Exclusive Assertion Groups (MEAGs) to incorporate data and control information into one mixed path. In NCL, the control is inherently present with each datum, so there is no need for worsecase delay analysis and control path delay matching. This dissertation ...

متن کامل

Optimization of NULL convention self-timed circuits

Self-timed logic design methods are developed using Threshold Combinational Reduction (TCR) within the NULL Convention Logic (NCL) paradigm. NCL logic functions are realized using 27 distinct transistor networks implementing the set of all functions of four or fewer variables, thus facilitating a variety of gatelevel optimizations. TCR optimizations are formalized for NCL and then assessed by c...

متن کامل

Accurate Throughput Derivation of Pipelined NULL Convention Logic Asynchronous Circuits

A throughput estimation formula for optimally pipelining NULL Convention Logic (NCL) asynchronous circuits was presented in the literature. However, it ignores register delays. This paper presents a precise throughput derivation formula for pipelined NCL circuits. The formula was verified by Spice simulation and can be used for static timing analysis.

متن کامل

5 GHz pipelined multiplier and MAC in 0.18µm complementary static CMOS

Wave pipelining improves the throughput of a circuit by exploiting the delays of combinational elements, rather than register clocks, for synchronization. Our proposed approach, called HyPipe, combines conventional register-based pipelining with wave pipelining and aims to take advantage of both pipelining methods [5]. In this paper, we applied HyPipe to develop 4-bit signed multipliers and 4-b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004